A stationary planar random graph with singular stationary dual: dyadic lattice graphs
نویسندگان
چکیده
منابع مشابه
Ergodic theory on stationary random graphs
A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random graphs of subexponential growth are almost surely Liouville, that is, admit no non constant bounded harmonic functions. Applications include the uniform infinite ...
متن کاملGenerating stationary random graphs on Z with prescribed i.i.d. degrees
Let F be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a stationary random graph, with vertex set Z, so that the degrees of the vertices are i.i.d. random variables with distribution F . Focus is on an algorithm where, initially, a random number of “stubs” with distribution F is attached to each vertex. Each stub is then random...
متن کاملStationary Markov Random Fields on a Finite Rectangular Lattice
This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborhood system. Equivalently, it characterizes stationary Markov fields on 2 whose restrictions to finite rectangular subsets are still Markovian (i.e., even on the boundaries). Until now, Pickard random fields formed the only ...
متن کاملStationary self-similar random elds on the integer lattice
We establish several methods for constructing stationary self-similar random elds (ssf ’s) on the integer lattice by “random wavelet expansion”, which stands for representation of random elds by sums of randomly scaled and translated functions, or more generally, by composites of random functionals and deterministic wavelet expansion. To construct ssf ’s on the integer lattice, random wavelet e...
متن کاملConcentration of the Stationary Distribution on General Random Directed Graphs
We consider a random model for directed graphs whereby an arc is placed from one vertex to another with a prescribed probability which may vary from arc to arc. Using perturbation bounds as well as Chernoff inequalities, we show that the stationary distribution of a Markov process on a random graph is concentrated near that of the “expected” process under mild conditions. These conditions invol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2019
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-019-00934-0